Quantum walks and reversible cellular automata
نویسندگان
چکیده
منابع مشابه
Exploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملDiscrete Lorentz covariance for quantum walks and quantum cellular automata
We formalize a notion of discrete Lorentz transforms for quantum walks (QW) and quantum cellular automata (QCA), in + (1 1)-dimensional discrete spacetime. The theory admits a diagrammatic representation in terms of a few local, circuit equivalence rules. Within this framework, we show the first-order-only covariance of the Dirac QW. We then introduce the clock QW and the clock QCA, and prove t...
متن کاملRelation between coined quantum walks and quantum cellular automata
Very recently Patel et al. [1] constructed a quantum walk (QW) on a line without using a coin toss instruction, and analyzed the asymptotic behavior of the walk on the line and its escape probability with an absorbing wall. In fact the QW investigated by them can be considered as a class of quantum cellular automata on the line (see [2, 3, 4], for examples), so we call their non-coined QW a qua...
متن کاملexploring and exploiting quantum-dot cellular automata
the full adders (fas) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. with respect to the mosfet restrictions, its replacement by new devices and technologies is inevitable. qca is one of the accomplishments in nanotechnology nominated as the candidate for mosfet replacement. in this article 4 new layouts are presented fo...
متن کاملRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2004
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2004.08.025